On the vertex ranking problem for trapezoid, circular-arc and other graphs
نویسندگان
چکیده
منابع مشابه
On Vertex Ranking for Permutations and Other Graphs
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملOn the Isomorphism Problem for Helly Circular-Arc Graphs
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-ar...
متن کاملCircular and Circle Trapezoid Graphs
Along with the direction that generalizes interval graphs and permutation graphs to trapezoid graphs, researchers are now trying to generalize the class known as trapezoid graphs. A circle trapezoid is the region in a circle that lies between two non-crossing chords; thus, circle trapezoid graphs are the intersecting graphs of circle trapezoids within a circle. It should be noted that circle tr...
متن کاملOn the Shooter Location Problem: Maintaining Dynamic Circular-Arc Graphs
We present a data structure for maintaining the Minimum Clique cover and Maximum Independent Set of a circular-arc graph. These functions can be maintained during the interchange of adjacent arc endpoints in O(logn) amortized time per interchange. The new data structure extends the dynamic tree structure of Sleator and Tarjan [5] so that cutting and linking up to O(n) subtrees can be done in on...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00179-1